Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/D5kLV
Repositorysid.inpe.br/banon/2004/08.06.11.34
Last Update2004:08.06.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2004/08.06.11.34.53
Metadata Last Update2022:06.14.00.12.39 (UTC) administrator
DOI10.1109/SIBGRA.2004.1352982
Citation KeyOliveiraRibFarEspGir:2004:SnEnTo
TitleLoop Snakes: Snakes with Enhanced Topology Control
FormatOn-line
Year2004
Access Date2024, May 02
Number of Files1
Size327 KiB
2. Context
Author1 Oliveira, Antonio
2 Ribeiro, Saulo
3 Farias, Ricardo
4 Esperança, Cláudio
5 Giraldi, Gilson
Affiliation1 Dept. of Systems Engineering and Computer Sciences - COPPE/UFRJ
2 National Lab. of Scientific Computing - LNCC
EditorAraújo, Arnaldo de Albuquerque
Comba, João Luiz Dihl
Navazo, Isabel
Sousa, Antônio Augusto de
e-Mail Addressoliveira@lcg.ufrj.br
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)
Conference LocationCuritiba, PR, Brazil
Date17-20 Oct. 2004
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2008-08-26 15:15:43 :: banon -> administrator ::
2009-08-13 20:37:29 :: administrator -> banon ::
2010-08-28 20:01:14 :: banon -> administrator ::
2022-06-14 00:12:39 :: administrator -> :: 2004
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordstopologically adaptable snakes
T-snakes
segment identification
loop
topology
AbstractTopologically adaptable snakes, or simply T-snakes, are a standard tool for automatically identifying multiple segments in an image. This work introduces a novel approach for controlling the topology of a T-snake. It focuses on the loops formed by the so-called projected curve which is obtained at every stage of the snake evolution. The idea is to make that curve the image of a piecewise linear mapping of an adequate class. Then, with the help of an additional structure—the Loop-Tree—it is possible to decide in O(1) time whether the region enclosed by each loop has already been explored by the snake. This makes it possible to construct an enhanced algorithm for evolving T-snakes whose performance is assessed by means of statistics and examples.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2004 > Loop Snakes: Snakes...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Loop Snakes: Snakes...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/D5kLV
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/D5kLV
Languageen
Target File5.pdf
User Groupbanon
administrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46QM2BE
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.03.00.29 9
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close